翻訳と辞書 |
Well-founded semantics : ウィキペディア英語版 | Well-founded semantics
In logic programming, the well-founded semantics is one definition of how we can make conclusions from a set of logical rules. In logic programming, we give a computer a set of facts, and a set of "inference rules" about how these facts relate. There are several different ways that we might want the computer to apply these rules; the well-founded semantics is one of these ways. ==History== The well-founded semantics was defined by Van Gelder, et al. in a 1991 paper.〔A. Van Gelder, K.A. Ross and J.S. Schlipf. ''The Well-Founded Semantics for General Logic Programs''. Journal of the ACM 38(3) pp. 620—650, 1991〕
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Well-founded semantics」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|